Performance Analysis of Protograph LDPC Codes over Large-Scale MIMO Channels with Low-Resolution ADCs

© 2013 IEEE. Protograph LDPC (P-LDPC) codes and large-scale multiple-input multiple-output (LS-MIMO) are cornerstones of 5G and future wireless systems, thanks to their powerful error-correcting capability and high spectral efficiency. To alleviate the high complexity in signal detection/decoding that dramatically grows with the number of antennas (in the order of tens or even hundreds), low-resolution analog-to-digital converters (ADCs) and joint detection and decoding using factor graph have recently attracted paramount interest. Unlike high-resolution ADCs, by using a small number of bits to quantize the received signal, low-resolution ADCs help reduce the hardware cost and power consumption of the RF circuit of practical LS-MIMO transceivers. Such a very much desirable reduction comes at the cost of additional quantization noise, introduced by low-resolution ADCs. This work aims to provide a unified framework to analyze the impact of the low-resolution ADCs on the performance of P-LDPC codes in practical LS-MIMO systems. It is worth noting that the previous analytical tools that have been used to evaluate the performance of P-LDPC codes do not account for the quantization noise effect of the low-resolution ADCs and the fact that the covariance of quantization noise depends on the fading channels. This article addresses this shortcoming by first leveraging the additive quantization noise model. We then derive the expression of extrinsic information for the belief-propagation LS-MIMO detector. The mutual information functions, which are the core elements of our proposed protograph extrinsic information transfer (PEXIT) algorithm, are analyzed for LS-MIMO communication systems. Our proposed PEXIT algorithm allows us to analyze and predict the impact of the low-resolution ADCs on the performance of P-LDPC codes, considering various input parameters, including the LS-MIMO configuration, the code rate, and the maximum number of decoding iterations, and the code structure. Based on our extensive analytical and simulation results, we found that the performance of 3-bit and 4-bit ADC systems only have a small gap to that of the unquantized systems. Especially when the 5-bit ADC scheme is applied, the performance loss is negligible. This finding sheds light on the practical design of LS-MIMO systems using P-LDPC codes

Jamming attack on in-band full-duplex communications: Detection and countermeasures

© 2016 IEEE. Recent advances in the design of in-band full-duplex (IBFD) radios promise to double the throughput of a wireless link. However, IBFD-capable nodes are more vulnerable to jamming attacks than their out-of-band full-duplex (OBFD) counterparts, and any advantages offered by them over the OBFD nodes can be jeopardized by such attacks. A jammer needs to attack both the uplink and the downlink channels to completely break the communication link between two OBFD nodes. In contrast, he only needs to jam one channel (used for both uplink and downlink) in the case of two IBFD nodes. Even worse, a jammer with the IBFD capability can learn the transmitters' activity while injecting interference, allowing it to react instantly with the transmitter's strategies. In this paper, we investigate frequency hopping (FH) technique for countering jamming attacks in the context of IBFD wireless radios. Specifically, we develop an optimal strategy for IBFD radios to combat an IBFD reactive sweep jammer. First, we introduce two operational modes for IBFD radios: transmission reception and transmission-detection. These modes are intended to boost the anti-jamming capability of IBFD radios. We then jointly optimize the decision of when to switch between the modes and when to hop to a new channel using Markov decision processes. Numerical investigations show that our policy significantly improves the throughput of IBFD nodes under jamming attacks

Price-based friendly jamming in a MISO interference wiretap channel

© 2016 IEEE. In this paper, we expand the scope of PHY-layer security by investigating TX-based friendly jamming (FJ) for the wiretap channel in multi-link settings. For the single-link scenario, creating a TX-based FJ is an effective and practical method in improving the secrecy rate. In a multi-link setting, several information signals must be transmitted simultaneously. Thus, the design must guarantee that the FJ signal of a given transmitter does not interfere with unintended but legitimate receivers. Under the assumption of exact knowledge of the eavesdropping channel, we first propose a distributed price-based approach to improve the secrecy sum-rate of a two-link network with one eavesdropper while satisfying an information-rate constraint for both link. Simulations show that price-based FJ control outperforms greedy FJ, and is close to the performance of a centralized approach. Next, we propose a method based on mixed strategic games that can offer robust solutions to the distributed secrecy sum-rate maximization problem under the assumption of an unknown eavesdropping channel. Lastly, we use simulations to show that in addition to outperforming the greedy approach, our robust optimization also satisfies practical network considerations. In particular, the transmission time for the robust optimization can be determined flexibly to match the channel's coherence time

Comment on "Soil salinity assessment by using near-infrared channel and Vegetation Soil Salinity Index derived from Landsat 8 OLI data: a case study in the Tra Vinh Province, Mekong Delta, Vietnam" by Kim-Anh Nguyen, Yuei-An Liou, Ha-Phuong Tran, Phi-Phung Hoang and Thanh-Hung Nguyen

Nguyen et al. (Prog Earth Planet Sci 7:1, 2020. ) suggest that Landsat 8 OLI can be used to map and monitor soil salinity in the coastal zone of the Mekong River Delta. The authors use empirical correlations between the near-infrared (NIR) band, or vegetation indexes containing the NIR band, and soil salinity. We show that within the coastal portion of the Mekong Delta, extensively ponded due to widespread shrimp farming, about 90% of Landsat 8 pixels are fully or partially covered by water. We then find that, due to strong NIR radiation absorption, NIR reflectance from ponded pixels decreases linearly with increasing water percentage cover, while no significant correlation is found between reflectance and soil salinity. Through detailed new analyses, we conclude that NIR reflectance attenuation cannot be ascribed to vegetation stress caused by soil salinity, but rather to the presence of water ponds. We also show that a similar behavior exists in ponded freshwater inland areas, confirming that the NIR absorption exerted by water is independent of salinity

Cognitive Networks with In-Band Full-Duplex Radios: Jamming Attacks and Countermeasures

© 2015 IEEE. Although in-band full-duplex (IBFD) radios promise to double the throughput of a wireless link, they are more vulnerable to jamming attacks than their out-of-band full-duplex (OBFD) counterparts. For two communicating OBFD nodes, a jammer needs to attack both the uplink and the downlink channels to completely break the communication link. In contrast, only one common channel needs to be jammed in the case of two IBFD nodes. Even worse, a jammer with self-interference suppression (SIS) capabilities (the underlying technique of IBFD radios) can learn the transmitters' activity while injecting interference, allowing it to react instantly to the transmitter's strategies. In this work, we consider a power-constrained IBFD 'reactive-sweep' jammer that sweeps through the set of channels by jamming a subset of them simultaneously. We model the interactions between the IBFD radios and the jammer as a stochastic constrained zero-sum Markov game in which nodes adopt the frequency hopping (FH) technique as their strategies to counter jamming attacks. Beside the IBFD transmission-reception (TR) mode, we introduce an additional operation mode, called transmission-detection (TD), in which an IBFD radio transmits and leverages its SIS capability to detect jammers. The aim of the TD mode is to make IBFD radios more cognitive to jamming. The nodes' optimal defense strategy that guides them when to hop and which operational mode (TD or TR) to use is then established from the equilibrium of the stochastic Markov game. We prove that this optimal policy has a threshold structure, in which IBFD nodes stay on the same channel up to a certain number of time slots before hopping. Simulation results show that our policy significantly improves the throughput of IBFD nodes under jamming attacks

Joint Power Control and User Association for NOMA-Based Full-Duplex Systems

© 1972-2012 IEEE. This paper investigates the coexistence of non-orthogonal multiple access (NOMA) and full-duplex (FD) to improve both spectral efficiency (SE) and user fairness. In such a scenario, NOMA based on the successive interference cancellation technique is simultaneously applied to both uplink (UL) and downlink (DL) transmissions in an FD system. We consider the problem of jointly optimizing user association (UA) and power control to maximize the overall SE, subject to user-specific quality-of-service and total transmit power constraints. To be spectrally-efficient, we introduce the tensor model to optimize UL users' decoding order and DL users' clustering, which results in a mixed-integer non-convex problem. For practically appealing applications, we first relax the binary variables and then propose two low-complexity designs. In the first design, the continuous relaxation problem is solved using the inner convex approximation framework. Next, we additionally introduce the penalty method to further accelerate the performance of the former design. For a benchmark, we develop an optimal solution based on brute-force search (BFS) over all possible cases of UAs. It is demonstrated in numerical results that the proposed algorithms outperform the conventional FD-based schemes and its half-duplex counterpart, as well as yield data rates close to those obtained by BFS-based algorithm

Polypyrrole RVC biofuel cells for powering medical implants

© 2017 IEEE. Batteries for implanted medical devices such as pacemakers typically require surgical replacement every 5 to 10 years causing stress to the patient and their families. A Biofuel cell uses two electrodes with enzymes embedded to convert sugar into electricity. To evaluate the power producing capabilities of biofuel cells to replace battery technology, polypyrrole electrodes were fabricated by compression with Glucose oxidase and Laccase. Vitreous carbon was added to increase the conductivity, whilst glutaraldehyde acted as a crosslinking molecule. A maximum open circuit potential of 558.7 mV, short circuit current of 1.09 mA and maximum power of 0.127 mW was obtained from the fuel cells. This was able to turn on a medical thermometer through a TI BQ25504 energy harvesting circuit, hence showing the powering potential for biomedical devices

A novel spectral-efficient resource allocation approach for NOMA-based full-duplex systems

© 2019 IEEE. This paper investigates the coexistence of non- orthogonal multiple access (NOMA) and full-duplex (FD), where the NOMA successive interference cancellation technique is applied simultaneously to both uplink (UL) and downlink (DL) transmissions in the same time-frequency resource block. Specifically, we jointly optimize the user association (UA) and power control to maximize the overall sum rate, subject to user-specific quality-of-service and total transmit power constraints. To be spectrally-efficient, we introduce the tensor model to optimize the UL users' decoding order and the DL users' clustering, which results in a mixed-integer non- convex problem. For solving this problem, we first relax the binary variables to be continuous, and then propose a low-complexity design based on the combination of the inner convex approximation framework and the penalty method. Numerical results show that the proposed algorithm significantly outperforms the conventional FD-based schemes, FD-NOMA and its half-duplex counterpart with random UA

Proof-of-Stake Consensus Mechanisms for Future Blockchain Networks: Fundamentals, Applications and Opportunities

© 2013 IEEE. The rapid development of blockchain technology and their numerous emerging applications has received huge attention in recent years. The distributed consensus mechanism is the backbone of a blockchain network. It plays a key role in ensuring the network's security, integrity, and performance. Most current blockchain networks have been deploying the proof-of-work consensus mechanisms, in which the consensus is reached through intensive mining processes. However, this mechanism has several limitations, e.g., energy inefficiency, delay, and vulnerable to security threats. To overcome these problems, a new consensus mechanism has been developed recently, namely proof of stake, which enables to achieve the consensus via proving the stake ownership. This mechanism is expected to become a cutting-edge technology for future blockchain networks. This paper is dedicated to investigating proof-of-stake mechanisms, from fundamental knowledge to advanced proof-of-stake-based protocols along with performance analysis, e.g., energy consumption, delay, and security, as well as their promising applications, particularly in the field of Internet of Vehicles. The formation of stake pools and their effects on the network stake distribution are also analyzed and simulated. The results show that the ratio between the block reward and the total network stake has a significant impact on the decentralization of the network. Technical challenges and potential solutions are also discussed